<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    318. Maximum Product of Word Lengths
   </h1>
   <p>
    Given a string array
    <code>
     words
    </code>
    , find the maximum value of
    <code>
     length(word[i]) * length(word[j])
    </code>
    where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b> <code>["abcw","baz","foo","bar","xtfn","abcdef"]</code>
<b>Output: </b><code>16 
<strong>Explanation: </strong></code>The two words can be <code>"abcw", "xtfn"</code><span style='font-family: sans-serif, Arial, Verdana, "Trebuchet MS";'>.</span></pre>
   <p>
    <b>
     Example 2:
    </b>
   </p>
   <pre>
<b>Input:</b> <code>["a","ab","abc","d","cd","bcd","abcd"]</code>
<b>Output: </b><code>4 
<strong>Explanation: </strong></code>The two words can be <code>"ab", "cd"</code><span style='font-family: sans-serif, Arial, Verdana, "Trebuchet MS";'>.</span></pre>
   <p>
    <b>
     Example 3:
    </b>
   </p>
   <pre>
<b>Input:</b> <code>["a","aa","aaa","aaaa"]</code>
<b>Output: </b><code>0 
<strong>Explanation: </strong></code>No such pair of words.
</pre>
  </div>
  <div>
   <h1 class="question_title">
    318. 最大单词长度乘积
   </h1>
   <p>
    给定一个字符串数组&nbsp;
    <code>
     words
    </code>
    ，找到&nbsp;
    <code>
     length(word[i]) * length(word[j])
    </code>
    &nbsp;的最大值，并且这两个单词不含有公共字母。你可以认为每个单词只包含小写字母。如果不存在这样的两个单词，返回 0。
   </p>
   <p>
    <strong>
     示例&nbsp;1:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>["abcw","baz","foo","bar","xtfn","abcdef"]</code>
<strong>输出: </strong><code>16 
<strong>解释:</strong> 这两个单词为<strong> </strong></code><code>"abcw", "xtfn"</code>。</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>["a","ab","abc","d","cd","bcd","abcd"]</code>
<strong>输出: </strong><code>4 
<strong>解释: </strong></code>这两个单词为 <code>"ab", "cd"</code>。</pre>
   <p>
    <strong>
     示例 3:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>["a","aa","aaa","aaaa"]</code>
<strong>输出: </strong><code>0 
<strong>解释: </strong>不存在这样的两个单词。</code></pre>
  </div>
 </body>
</html>